A linear temporal logic model checking method over finite words with correlated transition attributes

Temporal logic model checking techniques are applied, in a natural way, to the analysis of the set of finite traces composing a system log. The specific nature of such traces helps in adapting traditional techniques in order to extend their analysis capabilities. The paper presents an adaption of the classical Timed Propositional Temporal Logic to the case of finite words and considers relations among different attributes corresponding to different events. The introduced approach allows the use of general relations between event attributes by means of freeze quantifiers as well as future and past temporal operators. The paper also presents a decision procedure, as well as a study of its computational complexity

Retrovirus budding may constitute a port of entry for drug carriers

AbstractThis paper investigates the relation between viral infection and cell uptake of liposomes and nanoparticles. A defective virus was used to infect two types of cells: cells allowing virus budding (psi2neo cells) and cells bereft of a virus exit process (NIH 3T3 cells). This study has revealed that cell uptake of pH-sensitive-liposomes is highly dependent on the virus exit process, since it ensued only when virus budding occurred. This preferential uptake of pH-sensitive liposomes by infected cells was not carrier-specific because similar uptake was observed with non-biodegradable fluorescent nanoparticles using confocal microscopy. Also, inhibition of neo gene expression by oligonucleotide pH-sensitive-liposomes was only observed in the cell system (psi2neo) endowed with a virus exit process. Finally, increased membrane fluidity was noted in the infected cells, possibly reflecting membrane perturbation due to virus budding. We suggest that this membrane perturbation may be the key to the uptake of the different colloidal carriers. Infected cells could, thus, constitute a natural target for particulate drug carriers

Parametric LTL on Markov Chains

This paper is concerned with the verification of finite Markov chains against parametrized LTL (pLTL) formulas. In pLTL, the until-modality is equipped with a bound that contains variables; e.g., $\Diamond_{\le x}\ \varphi$ asserts that $\varphi$ holds within $x$ time steps, where $x$ is a variable on natural numbers. The central problem studied in this paper is to determine the set of parameter valuations $V_{\prec p} (\varphi)$ for which the probability to satisfy pLTL-formula $\varphi$ in a Markov chain meets a given threshold $\prec p$, where $\prec$ is a comparison on reals and $p$ a probability. As for pLTL determining the emptiness of $V_{> 0}(\varphi)$ is undecidable, we consider several logic fragments. We consider parametric reachability properties, a sub-logic of pLTL restricted to next and $\Diamond_{\le x}$, parametric B\"uchi properties and finally, a maximal subclass of pLTL for which emptiness of $V_{> 0}(\varphi)$ is decidable.Comment: TCS Track B 201

Применение метода контрольных возмущений для определения характерных узлов присоединения комплексной нагрузки при расчетах динамической устойчивости

Рассматривается влияние способа замещения комплексной нагрузки на характер электромеханических переходных процессов в электрических системах (ЭС) от действия больших возмущений. Показано, что установить общие рекомендации относительно способа замещения нагрузки в сложных ЭС затруднительно. Предлагается для опреде­ления характерных узлов нагрузки, оказывающих существенное влияние на характер динамического перехода, применять известный метод контрольных возмущений. Приводятся результаты сравнительных расчетов с использованием предлагаемой методики

Hierarchical Set Decision Diagrams and Automatic Saturation

International audienceShared decision diagram representations of a state-space have been shown to provide efficient solutions for model-checking of large systems. However, decision diagram manipulation is tricky, as the construction procedure is liable to produce intractable intermediate structures (a.k.a peak effect). The definition of the so-called saturation method has empirically been shown to mostly avoid this peak effect, and allows verification of much larger systems. However, applying this algorithm currently requires deep knowledge of the decision diagram data-structures, of the model or formalism manipulated, and a level of interaction that is not offered by the API of public DD packages.Hierarchical Set Decision Diagrams (SDD) are decision diagrams in which arcs of the structure are labeled with sets, themselves stored as SDD. This data structure offers an elegant and very efficient way of encoding structured specifications using decision diagram technology. It also offers, through the concept of inductive homomorphisms, unprecedented freedom to the user when defining the transition relation. Finally, with very limited user input, the SDD library is able to optimize evaluation of a transition relation to produce a saturation effect at runtime. We further show that using recursive folding, SDD are able to offer solutions in logarithmic complexity with respect to other DD. We conclude with some performances on well known examples

Activity of cefotiam in combination with beta-lactam antibiotics on enterobacterial hospital strains36636

By using checkerboard titrations the effect of cefotiam combined with different beta-lactam antibiotics on fifty strains of Enterobacteriaceae moderately susceptible (minimal inhibiting concentration greater than or equal to 8 mg/l) or resistant (minimal inhibiting concentration greater than or equal to 64 mg/l) to cefotiam was evaluated. The following compounds were tested: cefamandole, cefazolin, cefmenoxime, cefotaxime, cefotiam, ceftazidime, cefuroxime, mecillinam and piperacillin. The synergistic effect varied markedly. The combination cefotiam-mecillinam showed the highest rate of synergistic activity. Antagonism was found in 1% of the combinations</p

A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets

Abstract. Positive flows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of) positive flows in ordinary Petri nets are well known, computing a generative family of positive flows in colored net remains an open problem. We propose in this paper a pragmatic approach that allows us to define an algorithm that computes a generative family of particular but useful positive flows in a large subclass of colored nets: the simple well-formed nets.